A New Variation of Adaptive Simulated Annealing for 2D/3D Packing Optimization
نویسندگان
چکیده
منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملCylinder Packing by Simulated Annealing
This paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of ...
متن کاملSimulated annealing for weighted polygon packing
In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of weighted polygons inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of the container. This problem carries real practical significance in industrial applications (such as the design of satellites), as well as being of significant...
متن کاملAn Injection Rate Optimization in a Water Flooding Case Study with an Adaptive Simulated Annealing Techniques
This paper introduces an effective production optimization and a water injection allocation method for oil reservoirs with water injection. In this method, a two-stage adaptive simulated annealing (ASA) is used. A coarse-grid model is made based on average horizon permeability at the beginning iterations of the optimization to search quickly. In the second stage, the fine-grid model is used to ...
متن کاملAdaptive Simulated Annealing for Global Optimization in LS-OPT
The efficient search of global optimal solutions is an important contemporary subject. Different optimization methods tackle the search in different ways. The gradient based methods are among the fastest optimization methods but the final optimal solution depends on the starting point. The global search using these methods is carried out by providing many starting points. Other optimization met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Transactions on System LSI Design Methodology
سال: 2013
ISSN: 1882-6687
DOI: 10.2197/ipsjtsldm.6.94